Lecture 3: Simulating social networks

نویسنده

  • Bryan S. Graham
چکیده

(D1+, . . . , DN+) = (d1+, . . . , dN+) def = d+. Let DN,d+ denote the set of all undirected N ×N adjacency matrices with degree counts equal to d+. This note describes an algorithm for sampling uniformly from the set DN,d+ . Sampling uniformly from DN,d+ has a number of uses. First, as we will see later, it facilitates conditional inference on, and conditional estimation of, certain models of network formation. Second, in some settings the researcher may only observe agents’ degree and not their actual links. For example a researcher may know how many friends an individual has, but not who they are. In such cases, properties of the class of networks consistent with the available degree information may be of interest. A concrete example is helpful. Let f (D) be some function of the adjacency matrix, say its transitivity index. Among all undirected networks with degree sequences coinciding with D’s what fraction have a transitivity index less than the one observed in the network in hand? Let ∣∣DN,d+∣∣ denote the size, or cardinality, of DN,d+ . We seek to evaluate

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Virtual Training Tool for Giving Talks

In this paper we present two studies concerning the application of a virtual environment for public speaking anxiety. We have created a program simulating a virtual lecture room, which can be filled with a large number of listeners behaving in different ways. The purpose of the scene is to train people who are anxious to give talks in front of a large audience. We present the results of two stu...

متن کامل

Model for simulating mechanisms responsible of similarities between people connected in networks of social relations

The literature’s analysis has identified three social mechanisms explaining the similarity between people connected in the network of social relations: homophily, confounding and social contagion. The article proposes a model for simulating mechanisms responsible for similarity of attitudes in networks of social relations; along with a measure that is able to indicate which of the three mechani...

متن کامل

Lecture Notes for Introduction to Biological Modeling Class 4: Gene regulatory networks

Genetic regulation Central dogma of molecular biology: DNA makes RNA makes protein. Gene regulatory data are primarily from ChIP-chip and ChIP-seq. BioTapestry is an interactive tool for building, visualizing, and simulating genetic regulatory networks. Hamid Bolouri, a Hutch member, is an author. Transcription factors bound to DNA perform transcription regulation Small RNAs: miRNA (micro RNA) ...

متن کامل

Lecture Notes: Social Networks: Models, Algorithms, and Applications

For a positive integer n and an even integer k, let C(n, k) denote the graph with vertex set Figure 1: C(8, 4), newly rewired edges are excluded from future rewire. The Watts-Strogatz graph[2], denoted W S(n, k, p) is obtained from C(n, k) by replacing each edge in C(n, k) with probability p by a randomly chosen edge.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014